Applying an Incremental Satisfiability Algorithm to Automatic Test Pattern Generation
نویسندگان
چکیده
منابع مشابه
Learning Techniques for Automatic Test Pattern Generation using Boolean Satisfiability
Automatic Test Pattern Generation (ATPG) is one of the core problems in testing of digital circuits. ATPG algorithms based on Boolean Satisfiability (SAT) turned out to be very powerful, due to great advances in the performance of satisfiability solvers for propositional logic in the last two decades. SAT-based ATPG clearly outperforms classical approaches especially for hard-to-detect faults. ...
متن کاملTest pattern generation using Boolean satisfiability
This article describes the Boolean satisfiability method for generating test patterns for single stuck-at faults in combinational circuits. This new method generates test patterns in two steps: First, it constructs a formula expressing the Boolean diference between the unfaulted and faulted circuits. Second, it applies a Boolean satisjiability algorithm to the resulting formula. This approach d...
متن کاملParallel Test Pattern Generation Using Boolean Satisfiability
Recently, Larrabee proposed a sequential test generation algorithm for combinational circuits based on boolean satisfiability and presented results on benchmark circuits in support of the viability of this approach. Parallel implementations of test generation algorithms are attractive in view of the known difficulty (NP-completeness) of the problem. In this paper we suggest parallel versions of...
متن کاملAutomatic Generation of Test Suits by Applying Genetic Algorithm
The only objective of programming is not to determine the algorithm to accomplish a result, but relevance and correctness of the result also need to be ascertained. Correctness can be insured by applying testing to the result. Testing is most critical practice which is performed for supporting quality assurance. It is substantial but also arduous to warrant the quality of software; half of the ...
متن کاملAn Incremental Algorithm to Check Satisfiability for Bounded Model Checking
In Bounded Model Checking (BMC), the search for counterexamples of increasing lengths is translated into a sequence of satisfiability (SAT) checks. It is natural to try to exploit the similarity of these SAT instances by forwarding clauses learned during conflict analysis from one instance to the next. The methods proposed to identify clauses that remain valid fall into two categories: Those th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in Computing Science
سال: 2016
ISSN: 1870-4069
DOI: 10.13053/rcs-123-1-3